Search for: All records

The requirements for fault-tolerant quantum error correction can be simplified by leveraging structure in the noise of the underlying hardware. In this work, we identify a new type of structured noise motivated by neutral-atom qubits, biased erasure errors, which arises when qubit errors are dominated by detectable leakage from only one of the computational states of the qubit. We study the performance of this model using gate-level simulations of the XZZX surface code. Using the predicted erasure fraction and bias of metastable 171Yb qubits, we find a threshold of 8.2% for two-qubit gate errors, which is 1.9 times higher than the threshold for unbiased erasures and 7.5 times higher than the threshold for depolarizing errors. Surprisingly, the improved threshold is achieved without bias-preserving controlled-not gates and, instead, results from the lower noise entropy in this model. We also introduce an XZZX cluster state construction for measurement-based error correction, hybrid fusion, that is optimized for this noise model. By combining fusion operations and deterministic entangling gates, this construction preserves the intrinsic symmetry of the XZZX code, leading to a higher threshold of 10.3% and enabling the use of rectangular codes with fewer qubits. We discuss a potential physical implementation using a single plane of atoms and movable tweezers. 

The development of scalable, high-fidelity qubits is a key challenge in quantum information science. Neutral atom qubits have progressed rapidly in recent years, demonstrating programmable processors1,2 and quantum simulators with scaling to hundreds of atoms3,4. Exploring new atomic species, such as alkaline earth atoms5,6,7, or combining multiple species8 can provide new paths to improving coherence, control and scalability. For example, for eventual application in quantum error correction, it is advantageous to realize qubits with structured error models, such as biased Pauli errors9 or conversion of errors into detectable erasures10. Here we demonstrate a new neutral atom qubit using the nuclear spin of a long-lived metastable state in 171Yb. The long coherence time and fast excitation to the Rydberg state allow one- and two-qubit gates with fidelities of 0.9990(1) and 0.980(1), respectively. Importantly, a large fraction of all gate errors result in decays out of the qubit subspace to the ground state. By performing fast, mid-circuit detection of these errors, we convert them into erasure errors; during detection, the induced error probability on qubits remaining in the computational space is less than 10−5. This work establishes metastable 171Yb as a promising platform for realizing fault-tolerant quantum computing. 

Abstract Fault-tolerant cluster states form the basis for scalable measurement-based quantum computation. Recently, new stabilizer codes for scalable circuit-based quantum computation have been introduced that have very high thresholds under biased noise where the qubit predominantly suffers from one type of error, e.g. dephasing. However, extending these advances in stabilizer codes to generate high-threshold cluster states for biased noise has been a challenge, as the standard method for foliating stabilizer codes to generate fault-tolerant cluster states does not preserve the noise bias. In this work, we overcome this barrier by introducing a generalization of the cluster state that allows us to foliate stabilizer codes in a bias-preserving way. As an example of our approach, we construct a foliated version of the XZZX code which we call the XZZX cluster state. We demonstrate that under a circuit-level-noise model, our XZZX cluster state has a threshold more than double the usual cluster state when dephasing errors are more likely than errors that cause bit flips by a factor of order ~100 or more. 

Measurement-based quantum computing (MBQC) is an alternative model of quantum computation that is equivalent to the standard gate-based model and is the preferred approach for several optical quantum computing architectures. In MBQC, a quantum computation is executed by preparing an entangled cluster state and then selectively measuring qubits. MBQC can be made fault-tolerant by creating an MBQC computation that executes the standard surface code, an approach known as "foliation." Recent results on gate-based quantum computing have demonstrated that in the presence of biased noise, a modified version of the surface code known as the XZZX code has much higher thresholds than the standard surface code. However, naively foliating the XZZX code does not result in a high-threshold fault-tolerant MBQC, because the foliation procedure does not preserve the noise bias of the physical qubits. To create a high-threshold fault-tolerant MBQC, we introduce a modified cluster state that preserves the bias, and use our modified cluster state to construct an MBQC computation that executes the XZZX code. Using full circuit-level noise simulations, we show that the threshold of our modified MBQC is higher than either the standard fault-tolerant MBQC or the naïve foliated XZZX code in the presence of biased noise, demonstrating the advantage of our approach.